One-dimensional long-range percolation: A numerical study
نویسندگان
چکیده
منابع مشابه
Contact process on one-dimensional long-range percolation
In this note, we prove that the contact process on the one-dimensional longrange percolation with high exponent exhibits a non-trivial phase transition: there is a critical value of the infection rate λc > 0, such that if λ > λc, the contact process survives with positive probability, whereas if λ < λc, it dies out a.s.
متن کاملCompeting Long-Range Bonds and Site Dilution in the One-Dimensional Bond-Percolation Problem
The long-range bond-percolation problem, on a linear chain (d = 1), in the presence of diluted sites (with an occupancy probability ps for an active site) is studied by means of a Monte Carlo simulation. The occupancy probability for a bond between two active sites i and j, separated by a distance rij is given by pij = p/r ij , where p represents the usual occupancy probability between nearest-...
متن کاملLong-range percolation in R
Let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spreadout’ percolation model studied by Penrose [6], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the...
متن کاملLong-Range Percolation Mixing Time
We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2 [4, 9], the almost sure mixing time drops from N only to N (up to poly-logarithmic fact...
متن کاملGraph diameter in long-range percolation
We study the asymptotic growth of the diameter of the graph obtained by adding sparse “long” edges to a square box in Z. We focus on the cases when an edge between x and y is added with probability decaying with their Euclidean distance like |x − y| as |x − y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for a box of side L scales like (logL) where ∆ = log2(2d/s). In other words, the di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2017
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.96.012108